Derivation of self-scheduling algorithms for heterogeneous distributed computer systems: Application to internet-based grids of computers

Self-scheduling algorithms are useful tools for achieving load balance in heterogeneous computational systems. Therefore, they can be applied in computational Grids. In this work, we introduce two families of self-scheduling algorithms. The rst is de ned by methods looking for an explicit form for the chunks distribution function. The second corresponds to methods focusing in deriving an explicit form for the rate of variation of the chunks distribution function. From the rst family, we propose a Quadratic Self-Scheduling (QSS) algorithm. From the second, two new algorithms, Exponential Self-Scheduling (ESS) and Root Self-Scheduling (RSS) are introduced. QSS, ESS and RSS are tested in an Internet-based Grid of Computers involving resources from Spain and Mexico. Performance tests show that QSS and ESS outperform previous self-scheduling algorithms. QSS is found slightly more e cient than ESS. However, RSS shows a poor performance, a fact traced back to the curvature of the chunks distribution function.